Application of PROBE to the Multiconstraint Knapsack Problem
نویسندگان
چکیده
We consider the application of a new metaheuristic technique that we have proposed, known as PROBE (Population Reinforced Optimization Based Exploration), to the multiconstraint knapsack problem (MKP). In the current section, we begin by giving a brief introduction to PROBE; we then briefly review other metaheuristic approaches for the MKP. In Section 2, we describe our PROBE approach for the MKP. A brief discussion our results is given in Section 3.
منابع مشابه
The Temporal Knapsack Problem and Its Solution
This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack problem is a generalisation of the knapsack problem and specialisation of the multidimensional (or multiconstraint) knapsack problem. It arises naturally in applications such as allocating communication bandwidth or CPUs in a mul...
متن کاملWeight-Codings in a Genetic Algorithm for the Multiconstraint Knapsack Problem
This paper presents different variants of weight-coding in a genetic algorithm (GA) for solving the multiconstraint knapsack problem (MKP). In this coding, a chromosome is a vector of weights associated with the items of the MKP. The phenotype is obtained by using the weights to generate a modified version of the original problem and applying a decoding heuristic to it. Four techniques of biasi...
متن کاملSolving zero-one mixed integer programming problems using tabu search
We describe a tabu search (TS) approach for solving general zero-one mixed integer programming (MIP) problems that exploits the extreme point property of zero-one solutions. Specialized choice rules and aspiration criteria are identified for the problems, expressed as functions of integer infeasibility measures and objective function values. The first-level TS mechanisms are then extended with ...
متن کاملStatistical mechanics of the multi-constraint continuous knapsack problem
Abstract. We apply the replica analysis established by Gardner to the multiconstraint continuous knapsack problem, which is one of the linear programming problems and a most fundamental problem in the field of operations research (OR). For a large problem size, we analyse the space of solution and its volume, and estimate the optimal number of items to go into the knapsack as a function of the ...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کامل